Conundrum of Combinatorial Complexity

نویسنده

  • Leonid I. Perlovsky
چکیده

This paper examines fundamental problems underlying difficulties encountered by pattern recognition algorithms, neural networks, and rule systems. These problems are manifested as combinatorial complexity of algorithms, of their computational or training requirements. The paper relates particular types of complexity problems to the roles of a priori knowledge and adaptive learning. Paradigms based on adaptive learning lead to the complexity of training procedures, while nonadaptive rule-based paradigms lead to complexity of rule systems. Model-based approaches to combining adaptivity with a priori knowledge lead to computational complexity. Arguments are presented for the Aristotelian logic being culpable for the difficulty of combining adaptivity and a priority. The potential role of the fuzzy logic in overcoming current difficulties is discussed. Current mathematical difficulties are related to philosophical debates of the past.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Conundrum of Online Prescription Drug Promotion; Comment on “Trouble Spots in Online Direct-to-Consumer Prescription Drug Promotion: A Content Analysis of FDA Warning Letters”

This commentary discusses pertinent issues from Hyosun Kim’s paper on online prescription drug promotion. The study is well-designed and the findings highlight some of the consequences of the Food and Drug Administration’s (FDA’s) decision to deregulate online advertising of prescription drugs. While Kim’s findings confirm some of the early concerns, they also provide a perspective of implement...

متن کامل

An algorithm for multi-objective job shop scheduling problem

Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...

متن کامل

A Simulated Annealing Algorithm for Unsplittable Capacitated Network Design

The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...

متن کامل

Lateral Nasal Wall Respiratory Epithelial Adenomatoid Hamartoma (REAH): A Diagnostic Conundrum

Introduction: This study aims to report a rare case of a respiratory epithelial adenomatoid hamartoma (REAH) of the lateral nasal wall that had initially presented as a fungating mass, similar to that of a sinonasal malignancy, and its complete removal from the lateral nasal wall.   Case Report: We report the case of a 58-year-old woman who presented to us with a chief complaint of recurrent ri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Pattern Anal. Mach. Intell.

دوره 20  شماره 

صفحات  -

تاریخ انتشار 1998